The inequicut cone

Deza, M., K. Fukuda and M. Laurent, The inequicut cone, Discrete Mathematics 119 (1993) 21-48. Given a complete graph K, on n nodes and a subset S of nodes, the cut 6(S) defined by S is the set of edges of K, with exactly one endnode in S. A cut 6(S) is an equicut if ISI =L n/2 1 or r n/2 1 and an inequicut, otherwise. The cut cone C. (or inequicut cone 1C.) is the cone generated by the incidence vectors of all cuts (or inequicuts) of K.. The equicut polytope EP,, studied by Conforti et al. (1990) is the convex hull of the incidence vectors of all equicuts. We prove that IC, and EP, ‘inherit’ all facets of the cut cone C., namely, that every facet of the cut cone C, yields (by zero-lifting) a facet of the inequicut cone IC, for n 2n + 1. We construct several new classes of facets, not arising from C,, for the inequicut cone IC. and we describe its facial structure for n < 7.